A New Constraint Solver for 3D Lattices and Its Application to the Protein Folding Problem

نویسندگان

  • Alessandro Dal Palù
  • Agostino Dovier
  • Enrico Pontelli
چکیده

The paper describes the formalization and implementation of an efficient constraint programming framework operating on 3D crystal lattices. The framework is motivated and applied to address the problem of solving the abinitio protein structure prediction problem—i.e., predicting the 3D structure of a protein from its amino acid sequence. Experimental results demonstrate that our novel approach offers up to a 3 orders of magnitude of speedup compared to other constraint-based solutions proposed for the problem at hand.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A constraint solver for discrete lattices, its parallelization, and application to protein structure prediction

This paper presents the design, implementation and application of a Constraint Programming framework on 3D crystal lattices. The framework provides the flexibility to express and resolve constraints dealing with structural relationships of entities placed in a 3D lattice structure in space. The paper describes both sequential and parallel implementations of the framework, along with experiments...

متن کامل

Prediction of Protein Backbone Based on the Sliced Lattice Model

In the past decades, a significant number of studies on the prediction of protein 3D tertiary structures have been extensively made. However, the folding rules, the core issue of protein structure prediction, still stay unsolved. Given a target protein with its primary amino acid sequence, the protein backbone structure prediction (PSP) problem is to construct the 3D coordinates of α-carbon ato...

متن کامل

A new method for 3-D magnetic data inversion with physical bound

Inversion of magnetic data is an important step towards interpretation of the practical data. Smooth inversion is a common technique for the inversion of data. Physical bound constraint can improve the solution to the magnetic inverse problem. However, how to introduce the bound constraint into the inversion procedure is important. Imposing bound constraint makes the magnetic data inversion a n...

متن کامل

Train Scheduling Problem with Consideration of Praying Constraint as an Application of Job Shop Scheduling Problem

The present paper extends the idea of job shop scheduling problem with resting constraints to the train scheduling problem with the Muslim praying considerations. For this purpose, after proposing the new mathematical model, a heuristic algorithm based on the Electromagnetism-Like algorithm (EM) which is well adjusted to scheduling problems is employed to solve the large-size practical cases. T...

متن کامل

A New Implicit Dissipation Term for Solving 3D Euler Equations on Unstructured Grids by GMRES+LU-SGS Scheme

Due to improvements in computational resources, interest has recently increased in using implicit scheme for solving flow equations on 3D unstructured grids. However, most of the implicit schemes produce greater numerical diffusion error than their corresponding explicit schemes. This stems from the fact that in linearizing implicit fluxes, it is conventional to replace the Jacobian matrix in t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005